English Computing Dictionary
modulo arithmetic
(Or "clock arithmetic") A kind of integer
arithmetic that reduces all numbers to one of a fixed set
[0..N-1] (this would be "modulo N arithmetic") by effectively
repeatedly adding or subtracting N until the result is within
this range.
Ordinary "clock arithmetic" is like modulo arithmetic except
that the range is [1..12] whereas modulo 12 would be [0..11].
(1999-07-13)